#include <bits/stdc++.h>
using namespace std;
long long n,r[100007],m,maxn=-1,minn=9999999,ans=0;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%lld",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&m);
        r[m]++;
        maxn=max(maxn,m);
        minn=min(minn,m);
    }
    for(int i=minn;i<=maxn;i++)
        if(r[i]>ans)
            ans=r[i];
    printf("%lld",ans);
    return 0;
}
